Termination Orderings for Rippling
نویسندگان
چکیده
Rippling is a special type of rewriting developed for induct-ive theorem proving. Bundy et. al. have shown that rippling terminates by providing a well-founded order for the annotated rewrite rules used by rippling. Here, we simplify and generalize this order, thereby enlarging the class of rewrite rules that can be used. In addition, we extend the power of rippling by proposing new domain dependent orders. These extensions elegantly combine rippling with more conventional term rewriting. Such combinations ooer the exibility and uniformity of conventional rewriting with the highly goal directed nature of rippling. Finally, we show how our orders simplify implementation of provers based on rippling.
منابع مشابه
Using Rippling to Prove the Termination of Algorithms
c Deutsches Forschungszentrum f ¨ ur K ¨ unstliche Intelligenz 1997 This work may not be copied or reproduced in whole of part for any commercial purpose. Permission to copy in whole or part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of the Deu...
متن کاملMax-planck-institut F Ur Informatik Termination Orderings for Rippling K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses Publication Notes
Rippling is a special type of rewriting developed for inductive theorem proving Bundy et al have shown that rippling terminates by providing a well founded order for the annotated rewrite rules used by rippling Here we simplify and generalize this order thereby enlarging the class of rewrite rules that can be used In addition we extend the power of rippling by proposing new domain dependent ord...
متن کاملBest-First Rippling
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure that is decreases with each rewrite step. Because of this restriction, rippling will fail to prove theorems about, for example, mutual recursion as steps that temporarily increase the differences are necessary. Best-firs...
متن کاملDynamic Rippling, Middle-Out Reasoning and Lemma Discovery
We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence facilitates extending the technique in ways that preserve termination. We illustrate this by extending rippling with a terminating version of middle-out reasoning for lemma speculation. This supports automatic speculation of s...
متن کاملAutomating Inductive Specification Proofs
We present an automatic method which combines logical proof search and rippling heuristics to prove specifications. The key idea is to instantiate meta-variables in the proof with a simultaneous match based on rippling/reverse rippling heuristic. Underlying our rippling strategy is the rippling distance strategy which introduces a new powerful approach to rippling, as it avoids termination prob...
متن کامل